#include<bits/stdc++.h>
using namespace std;
//后序遍历算法的非递归描述
typedef char Elemtype;//定义Elemtype

typedef struct binode{
    Elemtype data;
    binode *left,*right;
}binode,*BiTree;

void PostReverse(BiTree bt){
    stack<<binode*,bool>> s;
    binode *p;
    if(!bt){
        return;
    }
    s.push(bt);
    while(!s.empty()){
        p = s.top();
        while(p->left){
            p = p->left;
            s.push(p);
        }
    }
}